Edge-Aware Graph Matching Network for Part-Based Semantic Segmentation
نویسندگان
چکیده
Abstract Semantic segmentation of parts objects is a marginally explored and challenging task in which multiple instances within those must be recognized an image. We introduce novel approach (GMENet) for this combining object-level context conditioning, part-level spatial relationships, shape contour information. The first target achieved by introducing class-conditioning module that enforces class-level semantics when learning the ones. Thus, intermediate-level features carry prior to decoding stage. To tackle ambiguity relationships among we exploit adjacency graph-based aims at matching between ground truth predicted maps. Last, additional further leverage edges localization. Besides testing our framework on already used Pascal-Part-58 Pascal-Person-Part benchmarks, two benchmarks large-scale part parsing, i.e., more version Pascal-Part with 108 classes ADE20K-Part benchmark 544 parts. GMENet achieves state-of-the-art results all considered tasks furthermore allows improve accuracy.
منابع مشابه
Context-Aware Graph Segmentation for Graph-Based Translation
In this paper, we present an improved graph-based translation model which segments an input graph into node-induced subgraphs by taking source context into consideration. Translations are generated by combining subgraph translations leftto-right using beam search. Experiments on Chinese–English and German–English demonstrate that the context-aware segmentation significantly improves the baselin...
متن کاملContour-aware network for semantic segmentation via adaptive depth
Semantic segmentation has been widely investigated for its important role in computer vision. However, some challenges still exist. The first challenge is how to perceive semantic regions with various attributes, which can result in unbalanced distribution of training samples. Another challenge is accurate semantic boundary determination. In this paper, a contour-aware network for semantic segm...
متن کاملRobust Edge Aware Descriptor for Image Matching
This paper presents a method called Robust Edge Aware Descriptor (READ) to compute local gradient information. The proposed method measures the similarity of the underlying structure to an edge using the 1D Fourier transform on a set of points located on a circle around a pixel. It is shown that the magnitude and the phase of READ can well represent the magnitude and orientation of the local gr...
متن کاملGraph Matching - Based Algorithms for FPGA Segmentation Design yYao
Yao-Wen Chang1, Jai-Ming Lin1, and D. F. Wong2 1Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan 2Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712, USA Abstract Process technology advances will soon make the one-million gate FPGA a reality. A key issue that needs to be solved for the large-scale FPGAs to reali...
متن کاملType-based Semantic Optimization for Scalable RDF Graph Pattern Matching
Scalable query processing relies on early and aggressive determination and pruning of query-irrelevant data. Besides the traditional space-pruning techniques such as indexing, type-based optimizations that exploit integrity constraints defined on the types can be used to rewrite queries into more efficient ones. However, such optimizations are only applicable in strongly-typed data and query mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2022
ISSN: ['0920-5691', '1573-1405']
DOI: https://doi.org/10.1007/s11263-022-01671-z